Computing Kernels in Directed Bichromatic Graphs
نویسندگان
چکیده
منابع مشابه
Computing kernels in graphs with a clique-cutset
In a directed graph, a kernel is a subset of the vertices that is both independent and absorbing. Not all directed graphs have a kernel, and finding classes of graphs having always a kernel or for which deciding the existence of a kernel is polynomial has been the topic of many works in graph theory. We formalize some techniques to build a kernel in a graph with a clique-cutset, knowing kernels...
متن کاملOn Graph Kernels: Hardness Results and Efficient Alternatives
As most ‘real-world’ data is structured, research in kernel methods has begun investigating kernels for various kinds of structured data. One of the most widely used tools for modeling structured data are graphs. An interesting and important challenge is thus to investigate kernels on instances that are represented by graphs. So far, only very specific graphs such as trees and strings have been...
متن کاملA Tree-Based Kernel for Graphs
This paper proposes a new tree-based kernel for graphs. Graphs are decomposed into multisets of ordered Directed Acyclic Graphs (DAGs) and a family of kernels computed by application of tree kernels extended to the DAG domain. We focus our attention on the efficient development of one member of this family. A technique for speeding up the computation is given, as well as theoretical bounds and ...
متن کاملOn the Acyclic Chromatic Number of Hamming Graphs
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum number k such that G has an acyclic coloring with k colors. In this paper, acyclic colorings of Hamming graphs, products of complete graphs, are considered.
متن کاملRevisiting End-to-End Trace Comparison with Graph Kernels
End-to-end tracing has emerged recently as a valuable tool to improve the dependability of distributed systems by performing dynamic verification and diagnosing correctness and performance problems. End-to-end traces are commonly represented as richly annotated directed acyclic graphs, with events as nodes and their causal dependencies as edges. Being able to automatically compare these graphs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 62 شماره
صفحات -
تاریخ انتشار 1997